# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def findNumberOfLIS(self, nums: List[int]) -> int:
        nums_len = len(nums)
        if nums_len == 1:
            return 1

        dp = [1] * nums_len
        gp = [1] * nums_len

        for i in range(0, nums_len):
            for j in range(0, i):
                if nums[i] > nums[j]:
                    if dp[i] == dp[j] + 1:
                        gp[i] += gp[j]
                    elif dp[i] < dp[j] + 1:
                        gp[i] = gp[j]
                        dp[i] = dp[j] + 1

        max_length = max(dp)

        ans = 0
        for i in range(nums_len):
            if dp[i] == max_length:
                ans += gp[i]

        return ans

if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 3, 5, 4, 7], 2),
        ([2, 2, 2, 2, 2], 5)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.findNumberOfLIS(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)
